The one container drayage problem with soft time windows
نویسندگان
چکیده
Intermodal freight transport consists of using different modes without changing the load unit. This results in a significant reduction time that goods spend at intermodal terminals, where transshipment takes place. Drayage refers to on trucks among depots, customers and suppliers. In spite fact drayage only represents between 5 10 percent total distance, it may amount up more than 30 costs. The aim this work is study operations. First, an extensive literature review undertaken. Since chain can become efficient by means proper organisation movements, optimization daily problem has been identified as one main ways reducing cost improving On problem, lack common benchmark hindered reaching further conclusions from all research carried out. Therefore, paper proposes framework presents generalized formulation which allows modeling most policies, with limitation considering one-container problems. Results show flexible tasks repositioning empty containers well soft windows reduce operating costs facilitate management companies. help consider adequate policies regarding operations terminals.
منابع مشابه
A goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملa goal programming model for vehicle routing problem with backhauls and soft time windows
the vehicle routing problem with backhauls (vrpb) as an extension of the classical vehicle routing prob-lem (vrp) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. a primary objective for the problem usually is minimizing the total distribution cost. most real-life problems have othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Transportation Economics
سال: 2021
ISSN: ['0739-8859', '1875-7979']
DOI: https://doi.org/10.1016/j.retrec.2020.100884